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 10, 2026 11:24boop34boop34Score: 69,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 11:2569,141583,580,004572,873,0001,004,0002,113,536
2Jul 10, 2026 11:2569,144583,629,783572,899,0001,003,0002,113,536
3Jul 10, 2026 11:2569,145583,622,072572,901,0001,005,0002,113,536
4Jul 10, 2026 11:2569,158588,444,244573,012,0001,002,0002,113,536
5Jul 10, 2026 11:2569,168583,781,644572,070,0002,032,0002,113,536
6Jul 10, 2026 11:2569,177583,944,157572,145,0002,025,0002,113,536
7Jul 10, 2026 11:2569,217584,219,299573,503,0001,004,0002,113,536
8Jul 10, 2026 11:2569,222584,349,090572,538,0002,012,0002,113,536
9Jul 10, 2026 11:2573,941623,432,651612,709,0001,003,0002,113,536