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 listMay 21, 2026 06:03Pavel KrajcevskiPavel KrajcevskiScore: 682,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 06:04630,4575,246,524,8025,222,795,00010,005,0002,125,824
2May 21, 2026 06:04649,5745,406,507,9865,380,344,00011,125,0002,125,824
3May 21, 2026 06:04680,8275,665,223,3655,639,815,00011,050,0002,125,824
4May 21, 2026 06:04681,3625,671,503,1235,644,057,00011,248,0002,125,824
5May 21, 2026 06:04682,7875,681,311,0355,656,010,00011,125,0002,125,824
6May 21, 2026 06:04690,8465,748,115,4165,722,825,00011,200,0002,125,824
7May 21, 2026 06:04695,1145,784,625,8565,758,170,00011,278,0002,125,824
8May 21, 2026 06:04695,9285,789,498,7255,766,174,00010,029,0002,125,824
9May 21, 2026 06:04706,0105,873,117,4105,848,615,00011,276,0002,125,824