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 10:31Rajarshi BasuRajarshi BasuScore: 16,756Success
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 10:3116,161165,853,030132,136,0002,002,0002,289,664
2Nov 30, 2025 10:3116,756165,984,522137,077,0002,001,0002,269,184
3Nov 30, 2025 10:3116,968167,193,440139,839,000998,0002,289,664