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 listApr 22, 2026 00:55Taylor DettlingTaylor DettlingScore: 24,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 00:5723,539213,467,810193,376,0002,003,0002,334,720
2Apr 22, 2026 00:5723,702214,926,810193,733,0002,995,0002,351,104
3Apr 22, 2026 00:5723,998215,412,926197,190,0002,001,0002,351,104
4Apr 22, 2026 00:5724,001222,624,982198,208,0001,001,0002,359,296
5Apr 22, 2026 00:5724,013220,907,352198,308,0001,001,0002,351,104
6Apr 22, 2026 00:5724,018217,210,861198,350,0001,001,0002,347,008
7Apr 22, 2026 00:5724,041217,573,052197,536,0002,005,0002,355,200
8Apr 22, 2026 00:5724,041223,744,520197,550,0001,995,0002,347,008
9Apr 22, 2026 00:5724,079215,856,942197,860,0001,998,0002,334,720