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 00:00Andrew EpsteinAndrew EpsteinScore: 217,284Success
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 00:01216,8221,809,957,3651,798,614,0001,010,0002,117,632stderr
2Sep 17, 2026 00:01217,0501,811,752,5951,800,510,0001,005,0002,117,632stderr
3Sep 17, 2026 00:01217,1411,812,641,1641,801,269,0001,005,0002,117,632stderr
4Sep 17, 2026 00:01217,1691,812,777,0141,801,503,0001,000,0002,117,632stderr
5Sep 17, 2026 00:01217,2841,813,781,6161,802,464,0001,000,0002,117,632stderr
6Sep 17, 2026 00:01217,3231,813,988,6541,802,778,0001,005,0002,117,632stderr
7Sep 17, 2026 00:01217,4271,814,903,5741,803,647,0001,002,0002,117,632stderr
8Sep 17, 2026 00:01217,7931,817,950,1091,806,682,0001,006,0002,117,632stderr
9Sep 17, 2026 00:01217,9561,819,199,3501,808,039,0001,002,0002,117,632stderr