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 12, 2026 12:39boop34boop34Score: 21,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 12:3921,285186,348,704175,660,0001,009,0002,113,536
2Jul 12, 2026 12:3921,737190,237,801179,413,0001,010,0002,113,536
3Jul 12, 2026 12:3921,740190,157,404179,440,0001,010,0002,113,536
4Jul 12, 2026 12:3921,756190,406,791179,569,0001,011,0002,113,536
5Jul 12, 2026 12:3921,757190,862,344179,578,0001,010,0002,113,536
6Jul 12, 2026 12:3921,758190,380,631179,583,0001,011,0002,113,536
7Jul 12, 2026 12:3921,762190,724,031179,618,0001,011,0002,113,536
8Jul 12, 2026 12:3921,776191,169,118179,731,0001,011,0002,113,536
9Jul 12, 2026 12:3921,899191,512,488180,756,0001,009,0002,113,536