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 listJun 22, 2026 12:32Omkar SinghOmkar SinghScore: 243,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 12:32243,3792,029,130,6651,961,336,00058,712,0002,113,536
2Jun 22, 2026 12:32243,3802,029,401,2421,960,510,00059,545,0002,113,536
3Jun 22, 2026 12:32243,4542,030,116,3601,960,515,00060,159,0002,113,536
4Jun 22, 2026 12:32243,4692,030,102,8321,961,354,00059,442,0002,113,536
5Jun 22, 2026 12:32243,4822,030,219,2391,961,314,00059,589,0002,113,536
6Jun 22, 2026 12:32243,4922,030,072,5521,961,373,00059,612,0002,113,536
7Jun 22, 2026 12:32243,5162,030,376,3541,961,341,00059,848,0002,113,536
8Jun 22, 2026 12:32243,5292,030,425,4111,961,290,00060,002,0002,113,536
9Jun 22, 2026 12:32243,5532,030,626,9601,961,470,00060,020,0002,113,536