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 3, 2026 18:31Josu San MartinJosu San MartinScore: 67,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 18:3160,844514,488,506500,993,0004,013,0002,113,536
2Jul 3, 2026 18:3167,537569,981,938555,393,0005,166,0002,113,536
3Jul 3, 2026 18:3167,615570,649,699556,477,0004,729,0002,113,536
4Jul 3, 2026 18:3167,754571,724,683558,346,0004,015,0002,113,536
5Jul 3, 2026 18:3167,903572,965,049558,677,0004,922,0002,113,536
6Jul 3, 2026 18:3168,368576,890,987563,378,0004,080,0002,113,536
7Jul 3, 2026 18:3168,405577,210,445563,725,0004,044,0002,113,536
8Jul 3, 2026 18:3168,591578,688,035564,453,0004,853,0002,113,536
9Jul 3, 2026 18:3168,640579,151,530565,680,0004,035,0002,113,536