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 10:46Dominique GarmierDominique GarmierScore: 6,875Success
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 10:496,79572,033,49454,386,0002,014,0002,330,624
2Apr 24, 2026 10:496,80271,742,63354,443,0002,016,0002,351,104
3Apr 24, 2026 10:496,80475,780,95254,459,0002,017,0002,342,912
4Apr 24, 2026 10:496,82981,602,47154,664,0002,024,0002,351,104
5Apr 24, 2026 10:496,87578,358,58254,063,0003,003,0002,342,912
6Apr 24, 2026 10:496,88080,498,56154,099,0003,005,0002,355,200
7Apr 24, 2026 10:496,90078,130,29955,266,0002,009,0002,351,104
8Apr 24, 2026 10:496,98476,166,92255,975,0001,999,0002,351,104
9Apr 24, 2026 10:496,98775,892,66654,997,0002,999,0002,347,008