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 07:52Dominique GarmierDominique GarmierScore: 7,559Success
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 07:537,54284,767,33260,580,0002,019,0002,437,120
2Apr 24, 2026 07:537,54380,060,47760,593,0002,019,0002,441,216
3Apr 24, 2026 07:537,54581,724,91260,611,0002,020,0002,342,912
4Apr 24, 2026 07:537,54885,178,54060,630,0002,021,0002,494,464
5Apr 24, 2026 07:537,55979,326,81559,757,0002,987,0002,445,312
6Apr 24, 2026 07:537,65085,871,90761,481,0002,015,0002,437,120
7Apr 24, 2026 07:537,67077,725,85361,648,0002,021,0002,437,120
8Apr 24, 2026 07:537,75986,101,35762,388,0002,012,0002,437,120
9Apr 24, 2026 07:537,77581,120,72462,518,0002,016,0002,433,024