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 14:18TudyMTudyMScore: 88,328Success
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 14:1888,260748,394,732675,593,00056,965,0002,437,120
2Apr 26, 2026 14:1888,269750,024,636673,669,00058,971,0002,367,488
3Apr 26, 2026 14:1888,295751,183,134669,869,00062,987,0002,359,296
4Apr 26, 2026 14:1888,296753,596,594673,869,00058,988,0002,322,432
5Apr 26, 2026 14:1888,328753,711,475675,116,00058,010,0002,375,680
6Apr 26, 2026 14:1888,329750,958,083674,123,00059,010,0002,371,584
7Apr 26, 2026 14:1888,351747,906,806672,294,00061,026,0002,310,144
8Apr 26, 2026 14:1888,405748,572,607674,783,00058,981,0002,367,488
9Apr 26, 2026 14:1888,450753,141,536675,130,00059,011,0002,379,776