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 26, 2026 15:24wnwnScore: 3,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:243,41041,703,39027,295,0001,010,0002,490,368
2Apr 26, 2026 15:243,41243,886,93527,312,0001,011,0002,486,272
3Apr 26, 2026 15:243,43646,091,47827,506,0001,018,0002,490,368
4Apr 26, 2026 15:243,45144,818,27327,623,0001,023,0002,490,368
5Apr 26, 2026 15:243,45445,353,89627,649,0001,024,0002,490,368
6Apr 26, 2026 15:243,46042,632,67227,693,0001,025,0002,486,272
7Apr 26, 2026 15:243,46744,709,97826,793,0001,984,0002,486,272
8Apr 26, 2026 15:243,47644,835,82826,869,0001,990,0002,326,528
9Apr 26, 2026 15:243,48341,285,46926,919,0001,994,0002,330,624