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 listApr 24, 2026 08:29Dominique GarmierDominique GarmierScore: 8,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 08:308,23290,325,89066,323,0002,009,0002,322,432
2Apr 24, 2026 08:308,23687,599,40566,353,0002,010,0002,396,160
3Apr 24, 2026 08:308,28384,027,39066,759,0001,992,0002,396,160
4Apr 24, 2026 08:308,30690,909,91965,945,0002,997,0002,408,448
5Apr 24, 2026 08:308,31789,131,85266,037,0003,001,0002,404,352
6Apr 24, 2026 08:308,32689,624,17466,102,0003,004,0002,408,448
7Apr 24, 2026 08:308,34287,512,06366,232,0003,010,0002,400,256
8Apr 24, 2026 08:308,41885,533,01567,875,0001,996,0002,396,160
9Apr 24, 2026 08:308,49788,386,57168,541,0001,986,0002,404,352