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 16:57Josu San MartinJosu San MartinScore: 71,601Success
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 17:0571,582603,597,903593,129,0001,002,0002,113,536
2Jul 3, 2026 17:0571,591603,597,091593,209,0001,002,0002,113,536
3Jul 3, 2026 17:0571,597603,791,828593,254,0001,003,0002,113,536
4Jul 3, 2026 17:0571,600604,163,242593,283,0001,003,0002,113,536
5Jul 3, 2026 17:0571,601603,731,889593,286,0001,003,0002,113,536
6Jul 3, 2026 17:0571,603603,793,794593,305,0001,003,0002,113,536
7Jul 3, 2026 17:0571,613603,770,286593,385,0001,003,0002,113,536
8Jul 3, 2026 17:0571,625603,858,123593,488,0001,002,0002,113,536
9Jul 3, 2026 17:0571,626603,907,961593,497,0001,003,0002,113,536