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 16, 2026 08:01wnwnScore: 3,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 08:023,70238,814,41729,698,0001,034,0002,113,536
2Jul 16, 2026 08:023,70638,704,77829,757,0001,009,0002,113,536
3Jul 16, 2026 08:023,70738,886,03029,745,0001,029,0002,113,536
4Jul 16, 2026 08:023,70838,889,56429,772,0001,007,0002,113,536
5Jul 16, 2026 08:023,70938,742,06129,771,0001,018,0002,113,536
6Jul 16, 2026 08:023,71038,968,39429,758,0001,038,0002,113,536
7Jul 16, 2026 08:023,72138,910,72229,840,0001,046,0002,113,536
8Jul 16, 2026 08:023,76739,151,54730,254,0001,018,0002,113,536
9Jul 16, 2026 08:023,78539,794,16130,374,0001,045,0002,113,536