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 21, 2026 12:50Victor MerckléVictor MerckléScore: 5,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 12:515,16552,037,22241,832,0001,045,0002,113,536
2May 21, 2026 12:515,16552,428,32541,810,0001,061,0002,113,536
3May 21, 2026 12:515,19852,756,86342,144,0001,003,0002,113,536
4May 21, 2026 12:515,19850,958,37842,120,0001,026,0002,113,536
5May 21, 2026 12:515,20151,076,38842,087,0001,086,0002,113,536
6May 21, 2026 12:515,20751,012,04042,201,0001,022,0002,113,536
7May 21, 2026 12:515,20951,029,63442,191,0001,047,0002,113,536
8May 21, 2026 12:515,24951,395,73142,529,0001,039,0002,113,536
9May 21, 2026 12:515,34852,230,38643,356,0001,036,0002,113,536