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 17, 2026 02:07Andrew EpsteinAndrew EpsteinScore: 173,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:08172,5161,442,199,9601,430,887,0001,003,0002,117,632stderr
2Sep 17, 2026 02:08172,7231,443,994,3671,431,561,0002,045,0002,117,632stderr
3Sep 17, 2026 02:08172,8491,444,846,0031,433,650,0001,001,0002,117,632stderr
4Sep 17, 2026 02:08173,2041,447,722,6611,436,593,0001,004,0002,117,632stderr
5Sep 17, 2026 02:08173,6601,451,673,3511,439,354,0002,026,0002,117,632stderr
6Sep 17, 2026 02:08173,7821,452,787,6231,440,291,0002,105,0002,117,632stderr
7Sep 17, 2026 02:08173,9391,454,006,9061,442,690,0001,004,0002,117,632stderr
8Sep 17, 2026 02:08174,0671,454,997,9381,442,748,0002,010,0002,117,632stderr
9Sep 17, 2026 02:08175,0421,463,174,3511,451,854,0001,001,0002,117,632stderr