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 16:55Jonathan GopelJonathan GopelScore: 329,231Success
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 16:55317,3522,660,053,8692,582,043,00051,980,0002,289,664
2Jan 15, 2026 16:55320,5412,692,267,3072,589,533,00070,959,0002,363,392
3Jan 15, 2026 16:55323,0192,703,709,5392,602,085,00078,972,0002,351,104
4Jan 15, 2026 16:55326,1762,732,811,1212,638,307,00068,955,0002,281,472
5Jan 15, 2026 16:55329,2312,754,666,5332,653,658,00078,960,0002,281,472
6Jan 15, 2026 16:55331,3012,773,339,6412,690,822,00058,974,0002,363,392
7Jan 15, 2026 16:55338,2242,832,184,1982,737,300,00069,956,0002,355,200
8Jan 15, 2026 16:55340,5322,848,121,7412,752,459,00073,958,0002,355,200
9Jan 15, 2026 16:55346,6012,904,691,6442,818,815,00057,975,0002,363,392