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 8, 2026 10:29wnwnScore: 4,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 10:294,32757,576,10033,922,0001,995,0002,498,560
2Mar 8, 2026 10:294,32861,346,75933,925,0001,995,0002,490,368
3Mar 8, 2026 10:294,33156,907,32533,949,0001,997,0002,498,560
4Mar 8, 2026 10:294,34655,254,31534,068,0002,004,0002,273,280
5Mar 8, 2026 10:294,35156,956,97234,110,0002,006,0002,527,232
6Mar 8, 2026 10:294,35658,171,55334,150,0002,008,0002,490,368
7Mar 8, 2026 10:294,36063,801,09934,177,0002,010,0002,494,464
8Mar 8, 2026 10:294,36469,426,08734,206,0002,012,0002,498,560
9Mar 8, 2026 10:294,38056,174,21435,342,0001,009,0002,498,560
10Mar 8, 2026 10:294,38957,373,58335,420,0001,012,0002,273,280
11Mar 8, 2026 10:294,40464,002,82935,539,0001,015,0002,273,280
12Mar 8, 2026 10:294,45056,723,85133,942,0002,994,0002,273,280