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 listMay 5, 2026 14:02M-RochatM-RochatScore: 21,820Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 14:0221,669198,726,929178,750,0001,104,0002,465,792
2May 5, 2026 14:0221,686198,753,142178,905,0001,093,0002,457,600
3May 5, 2026 14:0221,710198,340,711179,078,0001,120,0002,453,504
4May 5, 2026 14:0221,816201,007,248179,960,0001,116,0002,457,600
5May 5, 2026 14:0221,820196,778,625180,005,0001,101,0002,465,792
6May 5, 2026 14:0221,826198,474,510180,048,0001,114,0002,453,504
7May 5, 2026 14:0221,863200,506,294180,355,0001,113,0002,453,504
8May 5, 2026 14:0221,865197,762,520180,377,0001,107,0002,457,600
9May 5, 2026 14:0221,875199,291,152180,442,0001,122,0002,457,600