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 09:11Tan Lip WeiTan Lip WeiScore: 8,252Success
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 09:178,15695,557,46661,719,0005,972,0002,359,296
2Nov 2, 2025 09:178,17294,713,40756,856,00010,972,0002,392,064
3Nov 2, 2025 09:178,17893,725,71558,894,0008,983,0002,363,392
4Nov 2, 2025 09:178,22995,674,31160,383,0007,919,0002,371,584
5Nov 2, 2025 09:178,25299,464,38856,577,00011,911,0002,461,696
6Nov 2, 2025 09:178,34696,491,82759,231,00010,039,0002,375,680
7Nov 2, 2025 09:178,37597,411,07058,589,00010,923,0002,383,872
8Nov 2, 2025 09:178,40098,210,57459,762,0009,960,0002,441,216
9Nov 2, 2025 09:178,43893,916,21159,031,00011,005,0002,461,696