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 18, 2026 23:54Omkar SinghOmkar SinghScore: 89,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 23:5589,095748,567,822680,041,00059,448,0002,113,536
2Jun 18, 2026 23:5589,098748,697,167680,001,00059,518,0002,113,536
3Jun 18, 2026 23:5589,102748,706,371679,723,00059,825,0002,113,536
4Jun 18, 2026 23:5589,116748,815,174679,795,00059,868,0002,113,536
5Jun 18, 2026 23:5589,122748,751,492680,201,00059,512,0002,113,536
6Jun 18, 2026 23:5589,129748,802,135680,150,00059,628,0002,113,536
7Jun 18, 2026 23:5589,135748,911,101679,949,00059,877,0002,113,536
8Jun 18, 2026 23:5589,146749,336,187679,859,00060,059,0002,113,536
9Jun 18, 2026 23:5589,191749,780,807679,984,00060,307,0002,113,536