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 listSep 26, 2026 02:37Karthik ReddyKarthik ReddyScore: 4,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 02:374,59048,365,67136,971,0001,131,0002,113,536
2Sep 26, 2026 02:374,59048,303,98336,955,0001,148,0002,113,536
3Sep 26, 2026 02:374,59448,362,90436,949,0001,183,0002,113,536
4Sep 26, 2026 02:374,59448,463,30236,990,0001,143,0002,113,536
5Sep 26, 2026 02:374,59748,472,38937,004,0001,154,0002,113,536
6Sep 26, 2026 02:374,63348,681,90137,267,0001,188,0002,113,536
7Sep 26, 2026 02:374,70149,509,06337,881,0001,140,0002,113,536
8Sep 26, 2026 02:374,71449,357,17337,968,0001,160,0002,113,536
9Sep 26, 2026 02:374,72449,438,58838,068,0001,145,0002,113,536