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 8, 2026 17:42Victor MerckléVictor MerckléScore: 40,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 17:4639,861340,041,678329,751,0001,098,0002,117,632stderr
2Sep 8, 2026 17:4639,989341,042,114330,905,0001,006,0002,117,632stderr
3Sep 8, 2026 17:4640,274342,749,949333,221,0001,057,0002,117,632stderr
4Sep 8, 2026 17:4640,289342,932,094330,737,0003,663,0002,117,632stderr
5Sep 8, 2026 17:4640,305343,678,395330,676,0003,860,0002,117,632stderr
6Sep 8, 2026 17:4640,356344,110,467330,807,0004,154,0002,117,632stderr
7Sep 8, 2026 17:4650,489788,136,052354,798,00064,263,0002,117,632stderr
8Sep 8, 2026 17:4651,3861,018,642,120338,550,00087,961,0002,117,632stderr
9Sep 8, 2026 17:4657,6301,173,871,754330,508,000147,825,0002,117,632stderr