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 listApr 20, 2026 23:31Taylor DettlingTaylor DettlingScore: 55,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 23:3155,192484,468,509387,082,00071,015,0002,330,624
2Apr 20, 2026 23:3155,202476,755,054398,157,00060,023,0002,273,280
3Apr 20, 2026 23:3155,220471,686,557398,288,00060,043,0002,318,336
4Apr 20, 2026 23:3155,229485,238,062393,348,00065,057,0002,330,624
5Apr 20, 2026 23:3155,257489,568,097392,693,00065,948,0002,281,472
6Apr 20, 2026 23:3155,275486,709,839393,818,00064,970,0002,334,720
7Apr 20, 2026 23:3155,288472,789,891397,908,00060,985,0002,281,472
8Apr 20, 2026 23:3155,294484,240,149398,951,00059,992,0002,265,088
9Apr 20, 2026 23:3155,353488,244,802391,371,00068,064,0002,326,528