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 listJul 15, 2026 10:34boop34boop34Score: 13,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 10:3913,428121,152,632101,903,0009,556,00020,480
2Jul 15, 2026 10:3913,554122,237,236103,533,0008,968,00020,480
3Jul 15, 2026 10:3913,570123,050,557103,391,0009,247,0002,113,536
4Jul 15, 2026 10:3913,592122,652,348102,991,0009,828,0002,113,536
5Jul 15, 2026 10:3913,600123,172,345103,144,0009,739,0002,113,536
6Jul 15, 2026 10:3913,638123,113,851102,689,00010,509,00020,480
7Jul 15, 2026 10:3913,721123,933,192103,256,00010,633,00020,480
8Jul 15, 2026 10:3913,970125,652,528105,679,00010,273,0002,113,536
9Jul 15, 2026 10:3914,019126,087,319106,062,00010,300,00020,480