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 16:41Andrew EpsteinAndrew EpsteinScore: 9,862Success
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 16:499,80989,919,69080,308,0001,112,0002,117,632stderr
2Sep 17, 2026 16:499,80990,144,68880,351,0001,070,0002,117,632stderr
3Sep 17, 2026 16:499,82690,930,14680,484,0001,074,0002,117,632stderr
4Sep 17, 2026 16:499,84590,454,89280,654,0001,065,0002,117,632stderr
5Sep 17, 2026 16:499,86290,552,71880,795,0001,062,0002,117,632stderr
6Sep 17, 2026 16:499,86790,385,10680,826,0001,076,0002,117,632stderr
7Sep 17, 2026 16:499,86990,654,29780,832,0001,085,0002,117,632stderr
8Sep 17, 2026 16:499,87591,111,71180,902,0001,068,0002,117,632stderr
9Sep 17, 2026 16:499,91592,934,21581,233,0001,067,0002,117,632stderr