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 listMar 2, 2026 16:49Priyansh RathiPriyansh RathiScore: 44,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 16:4944,380399,261,936367,350,0001,000,0002,539,520
2Mar 2, 2026 16:4944,608398,424,089367,247,0003,002,0002,531,328
3Mar 2, 2026 16:4944,929407,802,620369,910,0002,999,0002,355,200