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 04:27Josu San MartinJosu San MartinScore: 5,401Success
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 04:275,12365,693,26141,508,0001,012,0002,265,088
2Apr 12, 2026 04:275,40174,406,36842,835,0001,992,0002,510,848
3Apr 12, 2026 04:275,48474,424,64743,495,0002,023,0002,342,912