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 listNov 5, 2026 20:51janwwwjanwwwScore: 4,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 20:524,03442,797,91432,375,0001,110,00020,480
2Nov 5, 2026 20:524,04542,835,82732,450,0001,129,00020,480
3Nov 5, 2026 20:524,05442,998,85032,523,0001,129,00020,480
4Nov 5, 2026 20:524,05742,948,94432,551,0001,123,00020,480
5Nov 5, 2026 20:524,06542,997,65532,602,0001,138,00020,480
6Nov 5, 2026 20:524,06743,097,38132,621,0001,139,00020,480
7Nov 5, 2026 20:524,09143,203,33432,845,0001,114,00020,480
8Nov 5, 2026 20:524,11643,424,58533,018,0001,151,00020,480
9Nov 5, 2026 20:524,16943,971,71533,441,0001,163,00020,480