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 17, 2026 00:06Victor MerckléVictor MerckléScore: 36,816Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:0836,640314,169,809303,013,0001,099,0002,117,632stderr
2Sep 17, 2026 00:0836,679314,308,894303,306,0001,130,0002,117,632stderr
3Sep 17, 2026 00:0836,679314,392,207303,432,0001,006,0002,117,632stderr
4Sep 17, 2026 00:0836,759315,015,274304,087,0001,017,0002,117,632stderr
5Sep 17, 2026 00:0836,816315,587,637304,568,0001,007,0002,117,632stderr
6Sep 17, 2026 00:0836,848315,742,439304,841,0001,001,0002,117,632stderr
7Sep 17, 2026 00:0836,886316,126,955305,149,0001,005,0002,117,632stderr
8Sep 17, 2026 00:0836,934316,640,131305,535,0001,022,0002,117,632stderr
9Sep 17, 2026 00:0837,141318,233,274307,172,0001,105,0002,117,632stderr