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 2, 2025 03:11Tan Lip WeiTan Lip WeiScore: 40,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 03:1140,089362,393,573322,746,0009,992,0002,355,200
2Nov 2, 2025 03:1140,106363,962,952323,885,0008,996,0002,363,392
3Nov 2, 2025 03:1140,119360,614,353323,986,0008,999,0002,465,792