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 listNov 30, 2025 09:10Rajarshi BasuRajarshi BasuScore: 19,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 30, 2025 09:1019,790189,162,689162,258,0002,003,0002,531,328
2Nov 30, 2025 09:1019,797187,114,258163,316,0001,001,0002,289,664
3Nov 30, 2025 09:1019,823195,975,519163,525,0001,003,0002,269,184