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 16:55Andrew EpsteinAndrew EpsteinScore: 3,452Success
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 16:593,39438,222,85127,150,0001,026,0002,113,536
2Sep 17, 2026 16:593,43741,658,19027,510,0001,025,0002,113,536
3Sep 17, 2026 16:593,43937,290,12027,525,0001,023,0002,113,536
4Sep 17, 2026 16:593,44737,280,81627,587,0001,024,0002,113,536
5Sep 17, 2026 16:593,45237,429,36227,637,0001,022,0002,113,536
6Sep 17, 2026 16:593,45638,802,32827,657,0001,035,0002,113,536
7Sep 17, 2026 16:593,47137,614,93627,794,0001,018,0002,113,536
8Sep 17, 2026 16:593,47237,548,81627,809,0001,013,0002,113,536
9Sep 17, 2026 16:593,50337,790,20128,046,0001,037,0002,113,536