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 24, 2026 08:02Dominique GarmierDominique GarmierScore: 7,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 08:027,21779,042,16857,911,0001,996,0002,437,120
2Apr 24, 2026 08:027,22178,165,79857,940,0001,997,0002,449,408
3Apr 24, 2026 08:027,22979,860,21957,007,0003,000,0002,433,024
4Apr 24, 2026 08:027,23177,086,62957,021,0003,001,0002,342,912
5Apr 24, 2026 08:027,24181,400,16357,099,0003,005,0002,445,312
6Apr 24, 2026 08:027,24183,177,96257,102,0003,005,0002,437,120
7Apr 24, 2026 08:027,29079,367,83958,496,0002,017,0002,441,216
8Apr 24, 2026 08:027,29679,470,51458,541,0002,018,0002,437,120
9Apr 24, 2026 08:027,35278,942,53458,022,0003,001,0002,437,120