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 listAug 1, 2026 11:45George SeabridgeGeorge SeabridgeScore: 140,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 11:46130,2981,092,302,9021,080,356,0001,118,0002,113,536
2Aug 1, 2026 11:46134,6711,127,876,0341,116,766,0001,004,0002,113,536
3Aug 1, 2026 11:46138,7361,161,548,6521,150,399,0001,113,0002,113,536
4Aug 1, 2026 11:46138,7731,161,998,1561,150,745,0001,079,0002,113,536
5Aug 1, 2026 11:46140,0411,172,359,7351,161,242,0001,104,0002,113,536
6Aug 1, 2026 11:46140,0651,172,570,8801,161,424,0001,116,0002,113,536
7Aug 1, 2026 11:46140,0711,172,680,8051,161,495,0001,100,0002,113,536
8Aug 1, 2026 11:46140,1161,173,855,9871,161,968,0001,003,0002,113,536
9Aug 1, 2026 11:46140,1201,172,986,5791,161,886,0001,114,0002,113,536