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 listSep 5, 2026 09:17Kevin HeaveyKevin HeaveyScore: 3,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 09:193,82641,983,25630,716,0001,047,0002,117,632
2Sep 5, 2026 09:193,85142,218,20230,927,0001,043,0002,117,632
3Sep 5, 2026 09:193,86042,318,38630,996,0001,043,0002,117,632
4Sep 5, 2026 09:193,86042,379,93630,998,0001,046,0002,117,632
5Sep 5, 2026 09:193,87142,283,04731,095,0001,041,0002,117,632
6Sep 5, 2026 09:193,87742,363,69531,141,0001,044,0002,117,632
7Sep 5, 2026 09:193,88742,456,16031,246,0001,021,0002,121,728
8Sep 5, 2026 09:193,89743,060,15131,306,0001,043,0002,117,632
9Sep 5, 2026 09:193,95343,022,15331,766,0001,044,0002,117,632