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:15Dominique GarmierDominique GarmierScore: 6,836Success
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:166,76872,454,56053,171,0003,009,0002,416,640
2Apr 24, 2026 08:166,77477,620,96153,214,0003,012,0002,342,912
3Apr 24, 2026 08:166,80376,757,54554,449,0002,016,0002,342,912
4Apr 24, 2026 08:166,81879,591,02654,574,0002,021,0002,342,912
5Apr 24, 2026 08:166,83678,117,61654,753,0001,991,0002,351,104
6Apr 24, 2026 08:166,84672,804,34853,837,0002,990,0002,355,200
7Apr 24, 2026 08:166,85873,158,98353,928,0002,996,0002,347,008
8Apr 24, 2026 08:167,00275,187,54356,118,0002,004,0002,441,216
9Apr 24, 2026 08:167,00475,132,19755,130,0003,007,0002,351,104