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 listOct 5, 2026 02:29FrederickFrederickScore: 8,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:298,25779,660,51466,451,0002,083,0002,117,632
2Oct 5, 2026 02:298,28479,269,31666,663,0002,097,0002,117,632
3Oct 5, 2026 02:298,44081,317,86867,953,0002,100,0002,117,632
4Oct 5, 2026 02:298,53981,718,74068,789,0002,088,0002,117,632
5Oct 5, 2026 02:298,54182,068,51168,776,0002,115,0002,117,632
6Oct 5, 2026 02:298,54383,010,84468,829,0002,081,0002,117,632
7Oct 5, 2026 02:298,61582,617,01069,363,0002,144,0002,117,632
8Oct 5, 2026 02:298,62382,616,65969,504,0002,075,0002,117,632
9Oct 5, 2026 02:298,68782,670,75270,028,0002,076,0002,117,632