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 listDec 29, 2025 06:10Josu San MartinJosu San MartinScore: 37,898Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 06:1037,852338,114,603250,137,00064,035,0002,273,280
2Dec 29, 2025 06:1037,898343,600,197246,435,00068,120,0002,273,280
3Dec 29, 2025 06:1038,094341,951,819248,143,00068,039,0002,387,968