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 listFeb 19, 2026 00:21Josu San MartinJosu San MartinScore: 6,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 00:216,18878,195,90251,363,00002,494,464
2Feb 19, 2026 00:216,36379,168,28650,822,0001,993,0002,330,624
3Feb 19, 2026 00:216,40681,320,03151,160,0002,006,0002,289,664
4Feb 19, 2026 00:216,47479,182,53550,749,0002,985,0002,322,432
5Feb 19, 2026 00:216,54782,762,05752,332,0002,012,0002,330,624
6Feb 19, 2026 00:216,61678,336,02453,911,000998,0002,465,792