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 listMar 31, 2026 13:01skylookupskylookupScore: 156,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 13:01156,2001,323,623,3911,214,495,00081,965,0002,289,664
2Mar 31, 2026 13:01156,2611,323,428,8701,204,043,00092,926,0002,506,752
3Mar 31, 2026 13:01156,2771,327,214,0091,222,155,00074,948,0002,289,664
4Mar 31, 2026 13:01156,2841,321,101,5561,220,206,00076,949,0002,289,664
5Mar 31, 2026 13:01156,2921,325,027,8321,230,261,00066,959,0002,285,568
6Mar 31, 2026 13:01156,3271,330,583,7541,215,608,00081,906,0002,289,664
7Mar 31, 2026 13:01156,3281,322,381,5021,222,610,00074,914,0002,289,664
8Mar 31, 2026 13:01156,3821,326,288,4421,214,034,00083,933,0002,293,760
9Mar 31, 2026 13:01156,4111,328,589,1841,222,257,00075,953,0002,289,664