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 3, 2026 20:11TudyMTudyMError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:130429,049,968411,455,0001,002,0002,379,776expected "53689473583765510 ", got "53689476743115817 "
2May 3, 2026 20:130430,126,099411,350,0001,002,0002,383,872expected "53687574325392973 ", got "53687574647437486 "
3May 3, 2026 20:1349,681430,563,154411,357,0001,003,0002,375,680
4May 3, 2026 20:1349,686429,543,765411,396,0001,002,0002,383,872
5May 3, 2026 20:1349,696428,733,724411,479,0001,003,0002,371,584
6May 3, 2026 20:1349,711426,292,067411,602,0001,003,0002,375,680
7May 3, 2026 20:1349,729432,087,362411,752,0001,003,0002,375,680
8May 3, 2026 20:1349,733429,330,849411,786,0001,003,0002,363,392
9May 3, 2026 20:1349,774430,482,387412,120,0001,005,0002,375,680