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 listJun 8, 2026 10:02chereshnya123chereshnya123Score: 58,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 10:0258,287493,036,677426,838,00056,951,0002,113,536
2Jun 8, 2026 10:0258,304492,971,347427,002,00056,924,0002,113,536
3Jun 8, 2026 10:0258,402494,047,859427,211,00057,533,0002,113,536
4Jun 8, 2026 10:0258,487494,577,355427,125,00058,324,0002,113,536
5Jun 8, 2026 10:0258,523494,915,986427,592,00058,156,0002,113,536
6Jun 8, 2026 10:0258,557495,175,088427,332,00058,692,0002,113,536
7Jun 8, 2026 10:0258,566495,093,550427,567,00058,534,0002,113,536
8Jun 8, 2026 10:0258,590495,402,078427,613,00058,691,0002,113,536
9Jun 8, 2026 10:0258,679496,108,082427,386,00059,655,0002,113,536