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 12, 2026 20:24Josu San MartinJosu San MartinScore: 6,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 20:245,11966,598,21641,474,0001,011,0002,285,568
2Apr 12, 2026 20:246,04474,176,36748,156,0002,006,0002,424,832
3Apr 12, 2026 20:246,05572,869,13848,243,0002,010,0002,285,568