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 listJul 17, 2026 21:28Adam FolwarcznyAdam FolwarcznyScore: 74,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 21:2974,508628,008,318617,420,0001,001,0002,113,536
2Jul 17, 2026 21:2974,522628,188,945617,532,0001,003,0002,113,536
3Jul 17, 2026 21:2974,542628,409,171617,698,0001,003,0002,113,536
4Jul 17, 2026 21:2974,556628,516,501617,813,0001,003,0002,113,536
5Jul 17, 2026 21:2974,559629,806,308617,839,0001,004,0002,113,536
6Jul 17, 2026 21:2974,564628,591,704617,883,0001,003,0002,113,536
7Jul 17, 2026 21:2974,567628,560,765617,907,0001,002,0002,113,536
8Jul 17, 2026 21:2974,586628,741,809618,064,0001,001,0002,113,536
9Jul 17, 2026 21:2974,603629,512,567618,204,0001,003,0002,113,536