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 listSep 12, 2026 16:02Kevin HeaveyKevin HeaveyScore: 3,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 16:033,64940,575,76729,244,0001,046,0002,117,632
2Sep 12, 2026 16:033,65940,549,48529,151,0001,223,0002,117,632
3Sep 12, 2026 16:033,69640,876,06329,437,0001,242,0002,117,632
4Sep 12, 2026 16:033,79841,872,50530,293,0001,236,0002,117,632
5Sep 12, 2026 16:033,89142,496,52231,071,0001,229,0002,117,632
6Sep 12, 2026 16:033,94142,940,42331,673,0001,039,0002,117,632
7Sep 12, 2026 16:033,94243,019,28831,687,0001,037,0002,117,632
8Sep 12, 2026 16:033,97743,231,12331,973,0001,043,0002,117,632
9Sep 12, 2026 16:033,99243,426,03831,893,0001,244,0002,117,632