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 30, 2026 00:27olliecrowolliecrowScore: 75,147Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 00:2975,089640,731,665621,244,0002,000,0002,322,432
2Apr 30, 2026 00:2975,099631,894,548622,328,0001,000,0002,375,680
3Apr 30, 2026 00:2975,104631,717,154621,366,0002,001,0002,318,336
4Apr 30, 2026 00:2975,123631,922,378620,524,0002,997,0002,375,680
5Apr 30, 2026 00:2975,147632,277,554621,723,0001,999,0002,359,296
6Apr 30, 2026 00:2975,159632,571,611620,825,0002,999,0002,375,680
7Apr 30, 2026 00:2975,197632,467,521622,140,0002,000,0002,375,680
8Apr 30, 2026 00:2975,220634,209,766622,332,0002,001,0002,363,392
9Apr 30, 2026 00:2975,236632,326,579620,469,0003,996,0002,375,680