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 listSep 23, 2026 08:14Kevin HeaveyKevin HeaveyScore: 3,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 08:173,33336,443,60426,540,0001,131,0002,113,536
2Sep 23, 2026 08:173,34136,488,96526,618,0001,116,0002,113,536
3Sep 23, 2026 08:173,34336,537,51026,621,0001,131,0002,113,536
4Sep 23, 2026 08:173,34436,558,20826,652,0001,110,0002,113,536
5Sep 23, 2026 08:173,35536,629,46426,839,0001,015,0002,113,536
6Sep 23, 2026 08:173,35737,525,96926,662,0001,205,0002,113,536
7Sep 23, 2026 08:173,36436,735,08326,900,0001,027,0002,113,536
8Sep 23, 2026 08:173,36836,782,69426,849,0001,107,0002,113,536
9Sep 23, 2026 08:175,61356,192,38445,556,0001,038,0002,113,536