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 listFeb 5, 2026 14:30howenhowenScore: 369,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 14:30368,6873,085,376,0803,004,136,00055,965,0002,359,296
2Feb 5, 2026 14:30368,6943,088,988,7213,001,198,00058,964,0002,289,664
3Feb 5, 2026 14:30369,3443,090,331,6322,993,589,00071,966,0002,289,664
4Feb 5, 2026 14:30369,4873,087,401,7352,997,768,00068,971,0002,281,472
5Feb 5, 2026 14:30369,7643,097,731,0993,000,062,00068,978,0002,363,392
6Feb 5, 2026 14:30370,2013,099,466,0243,004,697,00067,970,0002,289,664
7Feb 5, 2026 14:30371,2783,108,105,9943,030,632,00050,976,0002,281,472
8Feb 5, 2026 14:30372,7683,125,694,1333,028,995,00064,978,0002,281,472
9Feb 5, 2026 14:30389,3243,255,027,7533,165,424,00065,967,0002,289,664