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:07Dominique GarmierDominique GarmierScore: 7,358Success
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:087,24077,427,70457,093,0003,004,0002,445,312
2Apr 24, 2026 08:087,24781,880,36857,145,0003,007,0002,437,120
3Apr 24, 2026 08:087,26077,083,80257,253,0003,013,0002,445,312
4Apr 24, 2026 08:087,26978,671,81658,329,0002,011,0002,347,008
5Apr 24, 2026 08:087,35879,260,81658,070,0003,003,0002,437,120
6Apr 24, 2026 08:087,36080,742,89958,088,0003,004,0002,433,024
7Apr 24, 2026 08:087,37884,035,24658,227,0003,011,0002,437,120
8Apr 24, 2026 08:087,39779,705,39259,387,0002,013,0002,441,216
9Apr 24, 2026 08:087,40580,831,34359,451,0002,015,0002,441,216