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 14, 2026 21:06Ondřej PolaneckýOndřej PolaneckýScore: 72,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 21:0672,640625,708,353600,916,0001,999,0002,404,352
2Mar 14, 2026 21:0672,660630,696,954602,079,0001,000,0002,273,280
3Mar 14, 2026 21:0672,672626,243,387602,177,0001,000,0002,400,256
4Mar 14, 2026 21:0672,707630,761,001601,474,0001,998,0002,269,184
5Mar 14, 2026 21:0672,710622,992,817601,491,0001,998,0002,400,256
6Mar 14, 2026 21:0672,712630,734,503601,510,0001,998,0002,273,280
7Mar 14, 2026 21:0672,721631,159,473602,584,000999,0002,269,184
8Mar 14, 2026 21:0672,723631,128,999601,601,0001,998,0002,404,352
9Mar 14, 2026 21:0672,751628,073,132602,836,000999,0002,269,184