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 listMay 4, 2026 07:24limanjun99limanjun99Score: 5,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 07:255,17258,748,16239,713,0003,219,0002,506,752
2May 4, 2026 07:255,18558,285,80740,682,0002,354,0002,506,752
3May 4, 2026 07:255,18661,173,91140,681,0002,363,0002,510,848
4May 4, 2026 07:255,20059,508,44539,838,0003,328,0002,502,656
5May 4, 2026 07:255,22159,224,62840,990,0002,351,0002,502,656
6May 4, 2026 07:255,26864,766,85140,427,0003,298,0002,506,752
7May 4, 2026 07:255,28058,681,99141,591,0002,240,0002,494,464
8May 4, 2026 07:255,31361,167,42640,858,0003,240,0002,498,560
9May 4, 2026 07:255,31959,770,55640,929,0003,223,0002,506,752