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:57chereshnya123chereshnya123Score: 58,593Success
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:5858,448494,157,061426,946,00058,178,0002,113,536
2Jun 8, 2026 08:5858,474494,430,797427,266,00058,073,0002,113,536
3Jun 8, 2026 08:5858,488494,618,354427,038,00058,417,0002,113,536
4Jun 8, 2026 08:5858,530495,262,607427,228,00058,573,0002,113,536
5Jun 8, 2026 08:5858,593495,453,620427,739,00058,584,0002,113,536
6Jun 8, 2026 08:5858,594495,437,745427,477,00058,856,0002,113,536
7Jun 8, 2026 08:5858,618497,090,390427,218,00059,312,0002,113,536
8Jun 8, 2026 08:5858,640496,320,213427,235,00059,482,0002,113,536
9Jun 8, 2026 08:5858,727496,934,581427,210,00060,231,0002,113,536