Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMar 9, 2026 03:05olliecrowolliecrowScore: 5,947Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 9, 2026 03:055,51975,888,34243,813,0001,991,0002,461,696
2Mar 9, 2026 03:055,52268,288,66339,855,0005,978,0002,301,952
3Mar 9, 2026 03:055,53271,481,57442,925,0002,994,0002,437,120
4Mar 9, 2026 03:055,94775,743,45145,335,0004,029,0002,457,600
5Mar 9, 2026 03:055,96774,477,79147,508,0002,021,0002,392,064
6Mar 9, 2026 03:056,04974,242,99948,197,0002,008,0002,514,944