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 listJan 15, 2026 17:02Jonathan GopelJonathan GopelScore: 62,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 17:0262,766544,370,446463,959,00056,995,0002,306,048
2Jan 15, 2026 17:0262,828547,596,815466,529,00054,944,0002,281,472
3Jan 15, 2026 17:0262,915548,685,088458,171,00064,023,0002,289,664
4Jan 15, 2026 17:0262,919547,466,642463,205,00059,026,0002,289,664
5Jan 15, 2026 17:0262,965552,573,132469,652,00052,960,0002,306,048
6Jan 15, 2026 17:0263,007551,010,915471,964,00050,996,0002,289,664
7Jan 15, 2026 17:0263,049550,570,090462,273,00061,036,0002,301,952
8Jan 15, 2026 17:0263,087551,719,390465,664,00057,958,0002,289,664
9Jan 15, 2026 17:0263,737552,606,915473,018,00056,002,0002,306,048