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:09Andrew EpsteinAndrew EpsteinScore: 242,147Success
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:10241,4012,014,162,6422,000,421,0003,210,0002,121,728stderr
2Sep 17, 2026 00:10241,4292,014,181,7582,001,623,0002,239,0002,121,728stderr
3Sep 17, 2026 00:10241,7852,017,289,5492,003,608,0003,208,0002,121,728stderr
4Sep 17, 2026 00:10242,1252,019,971,0962,007,482,0002,163,0002,121,728stderr
5Sep 17, 2026 00:10242,1472,020,099,5082,006,662,0003,162,0002,121,728stderr
6Sep 17, 2026 00:10242,1952,020,553,8122,006,866,0003,358,0002,121,728stderr
7Sep 17, 2026 00:10242,3982,022,435,3232,007,360,0004,548,0002,121,728stderr
8Sep 17, 2026 00:10242,4542,022,673,2032,009,220,0003,154,0002,121,728stderr
9Sep 17, 2026 00:10243,1782,028,687,2932,015,219,0003,159,0002,121,728stderr