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 listJun 27, 2026 01:26Code HintsCode HintsScore: 6,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 01:276,08658,093,48148,473,0002,049,0002,113,536
2Jun 27, 2026 01:276,11358,287,18748,666,0002,075,0002,113,536
3Jun 27, 2026 01:276,13158,629,35448,825,0002,065,0002,113,536
4Jun 27, 2026 01:276,15858,813,24549,056,0002,056,0002,113,536
5Jun 27, 2026 01:276,16758,910,15349,128,0002,066,0002,113,536
6Jun 27, 2026 01:276,17158,725,59149,156,0002,066,0002,113,536
7Jun 27, 2026 01:276,17558,770,76349,208,0002,047,0002,113,536
8Jun 27, 2026 01:276,24259,345,29248,798,0003,017,0002,113,536
9Jun 27, 2026 01:276,42561,054,15851,256,0002,075,0002,113,536