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 listJun 8, 2026 08:25chereshnya123chereshnya123Score: 61,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 08:2561,511519,623,698453,717,00056,832,0002,113,536
2Jun 8, 2026 08:2561,530519,819,879453,771,00056,936,0002,113,536
3Jun 8, 2026 08:2561,576520,166,267453,812,00057,272,0002,113,536
4Jun 8, 2026 08:2561,621522,417,745453,848,00057,607,0002,113,536
5Jun 8, 2026 08:2561,629520,759,460453,999,00057,523,0002,113,536
6Jun 8, 2026 08:2561,656520,881,607453,796,00057,953,0002,113,536
7Jun 8, 2026 08:2561,682521,141,616453,910,00058,056,0002,113,536
8Jun 8, 2026 08:2561,710521,264,503453,891,00058,307,0002,113,536
9Jun 8, 2026 08:2561,737521,579,294453,981,00058,443,0002,113,536