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 1, 2025 13:25Tan Lip WeiTan Lip WeiScore: 37,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2025 13:2537,576338,722,860301,887,0009,996,0002,400,256
2Nov 1, 2025 13:2537,663336,079,095301,618,00010,986,0002,424,832
3Nov 1, 2025 13:2537,799343,838,314301,743,00011,989,0002,412,544