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 listFeb 22, 2026 14:06SneedSneedScore: 58,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 14:0658,537511,242,419438,873,00046,986,0002,289,664
2Feb 22, 2026 14:0658,576509,543,429429,159,00057,021,0002,465,792
3Feb 22, 2026 14:0658,669516,805,910429,955,00056,994,0002,465,792
4Feb 22, 2026 14:0658,751508,713,238430,677,00056,957,0002,289,664
5Feb 22, 2026 14:0658,794510,830,481442,993,00044,999,0002,281,472
6Feb 22, 2026 14:0658,912512,722,733440,975,00047,997,0002,318,336