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 listOct 22, 2026 16:18timothygktimothygkScore: 19,014Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2026 16:1818,610165,427,134105,856,00048,612,0002,117,632stderr
2Oct 22, 2026 16:1818,626165,877,032105,973,00048,623,0002,117,632stderr
3Oct 22, 2026 16:1818,656165,725,526105,836,00049,017,0002,117,632stderr
4Oct 22, 2026 16:1818,998168,618,837106,328,00051,358,0002,117,632stderr
5Oct 22, 2026 16:1819,014168,782,591106,715,00051,108,0002,117,632stderr
6Oct 22, 2026 16:1819,118170,216,237107,220,00051,462,0002,117,632stderr
7Oct 22, 2026 16:1819,138171,910,323107,147,00051,699,0002,117,632stderr
8Oct 22, 2026 16:1819,148170,423,106107,194,00051,739,0002,117,632stderr
9Oct 22, 2026 16:1819,185170,724,528107,480,00051,757,0002,117,632stderr