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:30Tan Lip WeiTan Lip WeiScore: 40,049Success
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:3040,034360,046,743324,299,0007,982,0002,281,472
2Nov 2, 2025 03:3040,049362,679,774321,424,00010,980,0002,289,664
3Nov 2, 2025 03:3040,098363,083,566322,823,0009,994,0002,441,216