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 27, 2026 10:05wnwnScore: 3,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:063,43047,957,35027,454,0001,016,0002,486,272
2Apr 27, 2026 10:063,43246,864,44427,476,0001,017,0002,490,368
3Apr 27, 2026 10:063,44542,068,45027,574,0001,021,0002,486,272
4Apr 27, 2026 10:063,47046,150,92226,823,0001,986,0002,490,368
5Apr 27, 2026 10:063,47240,857,91326,833,0001,987,0002,494,464
6Apr 27, 2026 10:063,47746,169,96726,871,0001,990,0002,494,464
7Apr 27, 2026 10:063,56747,350,85428,588,0001,021,0002,494,464
8Apr 27, 2026 10:063,57349,100,60828,636,0001,022,0002,486,272
9Apr 27, 2026 10:063,59547,974,18727,850,0001,989,0002,486,272