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 4, 2026 00:25Josu San MartinJosu San MartinScore: 6,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:256,12560,158,34947,747,0003,098,0002,113,536
2Jul 4, 2026 00:256,15060,417,03947,988,0003,064,0002,113,536
3Jul 4, 2026 00:256,15860,497,56848,016,0003,098,0002,113,536
4Jul 4, 2026 00:256,19960,833,00048,386,0003,069,0002,113,536
5Jul 4, 2026 00:256,24361,200,23648,768,0003,056,0002,113,536
6Jul 4, 2026 00:256,27461,426,60649,004,0003,078,0002,113,536
7Jul 4, 2026 00:256,34263,495,42949,563,0003,077,0002,113,536
8Jul 4, 2026 00:257,26269,646,36957,206,0003,071,0002,113,536
9Jul 4, 2026 00:257,38770,766,58858,267,0003,049,0002,113,536