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 listMar 2, 2026 15:28caandocaandoScore: 6,336Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 15:286,20377,028,16450,474,0001,009,0002,285,568
2Mar 2, 2026 15:286,21282,046,39250,548,0001,010,0002,514,944
3Mar 2, 2026 15:286,25084,443,18850,876,000997,0002,285,568
4Mar 2, 2026 15:286,33686,035,89351,574,0001,011,0002,269,184
5Mar 2, 2026 15:286,33978,916,66551,605,0001,011,0002,285,568
6Mar 2, 2026 15:286,36684,257,06550,847,0001,994,0002,285,568